0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.16/0.36 % Computer : n020.cluster.edu 0.16/0.36 % Model : x86_64 x86_64 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.36 % Memory : 8042.1875MB 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.36 % CPULimit : 1200 0.16/0.36 % WCLimit : 120 0.16/0.36 % DateTime : Tue Jul 13 15:35:06 EDT 2021 0.16/0.36 % CPUTime : 0.16/0.36 % Number of cores: 8 0.16/0.37 % Python version: Python 3.6.8 0.16/0.37 # Version: 2.6rc1-ho 0.16/0.38 # No SInE strategy applied 0.16/0.38 # Trying AutoSched0 for 59 seconds 0.22/0.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.22/0.49 # and selection function SelectComplexExceptUniqMaxHorn. 0.22/0.49 # 0.22/0.49 # Preprocessing time : 0.097 s 0.22/0.49 # Presaturation interreduction done 0.22/0.49 0.22/0.49 # Proof found! 0.22/0.49 # SZS status Theorem 0.22/0.49 # SZS output start CNFRefutation 0.22/0.49 thf(conj_0, conjecture, (listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.22/0.49 thf(fact_151_i__append__assoc, axiom, ![X745:list_a, X746:list_a, X747:nat > a]:(listIn1312259492pend_a @ X745 @ (listIn1312259492pend_a @ X746 @ X747))=(listIn1312259492pend_a @ (append_a @ X745 @ X746) @ X747), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_151_i__append__assoc)). 0.22/0.49 thf(fact_186_append__eq__Cons, axiom, ![X5:a, X327:list_a]:(append_a @ (cons_a @ X5 @ nil_a) @ X327)=(cons_a @ X5 @ X327), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_186_append__eq__Cons)). 0.22/0.49 thf(c_0_3, negated_conjecture, (listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)!=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.22/0.49 thf(c_0_4, plain, ![X3292:list_a, X3293:list_a, X3294:nat > a]:(listIn1312259492pend_a @ X3292 @ (listIn1312259492pend_a @ X3293 @ X3294))=(listIn1312259492pend_a @ (append_a @ X3292 @ X3293) @ X3294), inference(variable_rename,[status(thm)],[fact_151_i__append__assoc])). 0.22/0.49 thf(c_0_5, plain, ![X2642:a, X2643:list_a]:(append_a @ (cons_a @ X2642 @ nil_a) @ X2643)=(cons_a @ X2642 @ X2643), inference(variable_rename,[status(thm)],[fact_186_append__eq__Cons])). 0.22/0.49 thf(c_0_6, negated_conjecture, (listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)!=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.22/0.49 thf(c_0_7, plain, ![X2:list_a, X6:list_a, X161:nat > a]:(listIn1312259492pend_a @ X2 @ (listIn1312259492pend_a @ X6 @ X161))=(listIn1312259492pend_a @ (append_a @ X2 @ X6) @ X161), inference(split_conjunct,[status(thm)],[c_0_4])). 0.22/0.49 thf(c_0_8, plain, ![X5:a, X2:list_a]:(append_a @ (cons_a @ X5 @ nil_a) @ X2)=(cons_a @ X5 @ X2), inference(split_conjunct,[status(thm)],[c_0_5])). 0.22/0.49 thf(c_0_9, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7]), c_0_8])]), ['proof']). 0.22/0.49 # SZS output end CNFRefutation 0.22/0.49 # Proof object total steps : 10 0.22/0.49 # Proof object clause steps : 4 0.22/0.49 # Proof object formula steps : 6 0.22/0.49 # Proof object conjectures : 4 0.22/0.49 # Proof object clause conjectures : 2 0.22/0.49 # Proof object formula conjectures : 2 0.22/0.49 # Proof object initial clauses used : 3 0.22/0.49 # Proof object initial formulas used : 3 0.22/0.49 # Proof object generating inferences : 0 0.22/0.49 # Proof object simplifying inferences : 3 0.22/0.49 # Training examples: 0 positive, 0 negative 0.22/0.49 # Parsed axioms : 450 0.22/0.49 # Removed by relevancy pruning/SinE : 0 0.22/0.49 # Initial clauses : 1208 0.22/0.49 # Removed in clause preprocessing : 158 0.22/0.49 # Initial clauses in saturation : 1050 0.22/0.49 # Processed clauses : 291 0.22/0.49 # ...of these trivial : 8 0.22/0.49 # ...subsumed : 28 0.22/0.49 # ...remaining for further processing : 255 0.22/0.49 # Other redundant clauses eliminated : 95 0.22/0.49 # Clauses deleted for lack of memory : 0 0.22/0.49 # Backward-subsumed : 0 0.22/0.49 # Backward-rewritten : 2 0.22/0.49 # Generated clauses : 74 0.22/0.49 # ...of the previous two non-trivial : 29 0.22/0.49 # Contextual simplify-reflections : 0 0.22/0.49 # Paramodulations : 0 0.22/0.49 # Factorizations : 0 0.22/0.49 # NegExts : 0 0.22/0.49 # Equation resolutions : 95 0.22/0.49 # Propositional unsat checks : 0 0.22/0.49 # Propositional check models : 0 0.22/0.49 # Propositional check unsatisfiable : 0 0.22/0.49 # Propositional clauses : 0 0.22/0.49 # Propositional clauses after purity: 0 0.22/0.49 # Propositional unsat core size : 0 0.22/0.49 # Propositional preprocessing time : 0.000 0.22/0.49 # Propositional encoding time : 0.000 0.22/0.49 # Propositional solver time : 0.000 0.22/0.49 # Success case prop preproc time : 0.000 0.22/0.49 # Success case prop encoding time : 0.000 0.22/0.49 # Success case prop solver time : 0.000 0.22/0.49 # Current number of processed clauses : 179 0.22/0.49 # Positive orientable unit clauses : 82 0.22/0.49 # Positive unorientable unit clauses: 0 0.22/0.49 # Negative unit clauses : 16 0.22/0.49 # Non-unit-clauses : 81 0.22/0.49 # Current number of unprocessed clauses: 788 0.22/0.49 # ...number of literals in the above : 2851 0.22/0.49 # Current number of archived formulas : 0 0.22/0.49 # Current number of archived clauses : 2 0.22/0.49 # Clause-clause subsumption calls (NU) : 1625 0.22/0.49 # Rec. Clause-clause subsumption calls : 1465 0.22/0.49 # Non-unit clause-clause subsumptions : 24 0.22/0.49 # Unit Clause-clause subsumption calls : 133 0.22/0.49 # Rewrite failures with RHS unbound : 0 0.22/0.49 # BW rewrite match attempts : 8 0.22/0.49 # BW rewrite match successes : 2 0.22/0.49 # Condensation attempts : 0 0.22/0.49 # Condensation successes : 0 0.22/0.49 # Termbank termtop insertions : 72487 0.22/0.49 0.22/0.49 # ------------------------------------------------- 0.22/0.49 # User time : 0.110 s 0.22/0.49 # System time : 0.014 s 0.22/0.49 # Total time : 0.125 s 0.22/0.49 # Maximum resident set size: 2800 pages 0.22/0.49 EOF